Collateral Runs

When Short Runs Beat Long Runs

What will yield the best results: doing one run n generations long or doing m runs n/m generations long each? This paper presents a techniqueindependent analysis which answers this question, and has direct applicability to scheduling and restart theory in evolutionary computation and other stochastic methods. The paper then applies this technique to three problem domains in genetic programming....

Repo Runs

This paper develops a model of financial institutions that borrow shortterm and invest into long-term marketable assets. Because these financial intermediaries perform maturity transformation, they are subject to potential runs. We endogenize the profits of such intermediaries and derive distinct liquidity and collateral conditions that determine whether a run can be prevented. We examine the m...

Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs

Iterative algorithms based on runs and runs of runs are presented to calculate the cells of the two–dimensional lattice intersected by a line of real slope and intercept. The technique is applied to the problem of traversing a ray through a two–dimensional grid. Using runs or runs of runs provides a significant improvement in the efficiency of ray traversal for all but very short path lengths w...

On Runs in Independent Sequences

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

Verify Your Runs